ON LINEARIZING GRAPHSWITT KU.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 32-41; BIBL. 9 REF.Conference Paper

THE EVOLUTION OF UNLABELLED GRAPHS.WRIGHT EM.1976; J. LONDON MATH. SOC.; G.B.; DA. 1976; VOL. 14; NO 3; PP. 554-558; BIBL. 9 REF.Article

ENUMERATION OF SMOOTH LABELLED GRAPHSWRIGHT EM.1982; PROC. R. SOC. EDINB., SECT. A, MATH.; ISSN 0308-2105; GBR; DA. 1982; VOL. 91; NO 3-4; PP. 205-212; BIBL. 14 REF.Article

TWO SETS OF GRACEFUL GRAPHSDELORME C.1980; J. GRAPH THEORY; USA; DA. 1980; VOL. 4; NO 2; PP. 247-250; BIBL. 2 REF.Article

TRIANGLES IN LABELLED CUBIC GRAPHSWORMALD NC.1978; LECTURE NOTES MATH.; DEU; DA. 1978; NO 686; PP. 337-345; BIBL. 7 REF.Conference Paper

A CONSTRUCTIVE PROOF OF TUCKER'S COMBINATIONAL LEMMAFREUND RM; TODD MJ.1981; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1981; VOL. 30; NO 3; PP. 321-325; BIBL. 10 REF.Article

THE GRAPHS WITH ONLY SELF-DUAL SIGNINGSHARARY F; KOMMEL HJ.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 26; NO 3; PP. 235-241; BIBL. 6 REF.Article

THE ASYMPTOTIC CONNECTIVITY OF LABELLED REGULAR GRAPHSWORMALD NC.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 31; NO 2; PP. 156-167; BIBL. 8 REF.Article

ENUMERATION OF LABELLED GRAPHS. II: CUBIC GRAPHS WITH A GIVEN CONNECTIVITYWORMALD NC.1979; J. LONDON MATH. SOC.; GBR; DA. 1979; VOL. 20; NO 1; PP. 1-7; BIBL. 11 REF.Article

COMPUTING AUTOMORPHISMS AND CANONICAL LABELLING OF GRAPHSMCKAY BD.1978; LECTURE NOTES MATH.; DEU; DA. 1978; NO 686; PP. 223-232; BIBL. 7 REF.Conference Paper

ALPHA-BALANCED GRAPHS AND MATRICES AND GF(3)-REPRESENTABILITY OF MATROIDSTRUEMPER K.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 32; NO 2; PP. 112-139; BIBL. 16 REF.Article

BURNSIDE'S LEMMA: A HISTORICAL NOTEWRIGHT EM.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 1; PP. 89-90; BIBL. 8 REF.Article

COMPARISON OF WEIGHTED LABELLED TREESROBINSON DF; FOULDS LR.1979; LECTURE NOTES MATH.; DEU; DA. 1979; NO 748; PP. 119-126; BIBL. 5 REF.Conference Paper

GROUP LABELINGS OF GRAPHSEDELMAN PH; SAKS M.1979; J. GRAPH. THEORY; USA; DA. 1979; VOL. 3; NO 2; PP. 135-140; BIBL. 2 REF.Article

LINEAR ALGORITHMS ON RECURSIVE REPRESENTATIONS OF TREESMITCHELL SL; COCKAYNE EJ; HEDETNIEMI ST et al.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 18; NO 1; PP. 76-85; BIBL. 21 REF.Article

A CHARACTERIZATION OF OUTERPLANAR GRAPHSBROERE I.1979; J. MATH. & PHYS. SCI.; ISSN 0047-2557; IND; DA. 1979; VOL. 13; NO 6; PP. 615-620; BIBL. 3 REF.Article

FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHS.WRIGHT EM.1977; QUART. J. MATH.; G.B.; DA. 1977; VOL. 28; NO 111; PP. 363-367; BIBL. 3 REF.Article

SUR UN SCHEMA GENERAL D'ENUMERATION POUR LES GRAPHES ETIQUETESLISKOVETS VA.1977; DOKL. AKAD. NAUK B.S.S.R.; S.S.S.R.; DA. 1977; VOL. 21; NO 6; PP. 496-499; BIBL. 12 REF.Article

ENUMERATION OF LABELLED GRAPHS. I. 3-CONNECTED GRAPHSWORMALD N.1979; J. LONDON MATH. SOC.; GBR; DA. 1979; VOL. 19; NO 1; PP. 7-13; BIBL. 7 REF.Article

CHARACTERIZATION OF REGULAR MAGIC GRAPHS.DOOB M.1978; J. COMBINATOR. THEORY; USA; DA. 1978; VOL. 25; NO 1; PP. 94-104; BIBL. 10 REF.Article

THE K-CONNECTEDNESS OF UNLABELLED GRAPHSWALSH TRS; WRIGHT EM.1978; J. LONDON MATH. SOC.; GBR; DA. 1978; VOL. 18; NO 3; PP. 397-402; BIBL. 14 REF.Article

LARGE CYCLES IN LARGE LABELLED GRAPHS II.WRIGHT EM.1977; MATH. PROC. CAMBRIDGE PHILOS. SOC.; G.B.; DA. 1977; VOL. 81; NO 1; PP. 1-2; BIBL. 2 REF.Article

SUR LES PROPRIETES DES SEQUENCES PARCOURANT LES ARCS D'UN GRAPHE ORIENTE-ETIQUETE.PAYAN C; SIFAKIS J.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 273-277; ABS. ANGL.Conference Paper

GRACEFUL NUMBERING OF WHEELS AND RELATED GRAPHSFRUCHT R.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 219-229; BIBL. 8 REF.Conference Paper

LABELED BIPARTITE BLOCKSHARARY F; ROBINSON RW.1979; CANAD. J. MATH.; CAN; DA. 1979; VOL. 31; NO 1; PP. 60-68; BIBL. 8 REF.Article